965D - Single-use Stones - CodeForces Solution


binary search flows greedy two pointers *1900

Please click on ads to support us..

Python Code:

linha = input().split()
 
largura = int(linha[0])
 
l = int(linha[1])
 
rio = input().split()
 
for i in range(len(rio)):
 
    rio[i] = int(rio[i])
 
soma = 0
 
for i in range(l):
 
    soma += rio[i]
 
    i+=1
 
minim = soma
 
for i in range(l, largura-1):
 
    soma = soma - rio[i-l] + rio[i]
 
    minim = min(minim, soma)
 
print(minim)
 			 	 	 		 						  							 		


Comments

Submit
0 Comments
More Questions

337B - Routine Problem
1392D - Omkar and Bed Wars
76E - Points
762C - Two strings
802M - April Fools' Problem (easy)
577B - Modulo Sum
1555B - Two Tables
1686A - Everything Everywhere All But One
1469B - Red and Blue
1257B - Magic Stick
18C - Stripe
1203B - Equal Rectangles
1536A - Omkar and Bad Story
1509A - Average Height
1506C - Double-ended Strings
340A - The Wall
377A - Maze
500A - New Year Transportation
908D - New Year and Arbitrary Arrangement
199A - Hexadecimal's theorem
519C - A and B and Team Training
631A - Interview
961B - Lecture Sleep
522A - Reposts
1166D - Cute Sequences
1176A - Divide it
1527A - And Then There Were K
1618E - Singers' Tour
1560B - Who's Opposite
182B - Vasya's Calendar